Algebraic Deadlock Avoidance Policies for Conjunctive / Disjunctive resource Allocation Systems
نویسندگان
چکیده
منابع مشابه
A Polynomial-Complexity Deadlock Avoidance Policy for Sequential Resource Allocation Systems with Multiple Resource Acquisitions and Flexible Routings
The need for effective and efficient deadlock avoidance policies (DAP’s) is ever increasing due to the higher demand for system automation. This paper considers the deadlock avoidance problem for the class of Conjunctive/Disjunctive (sequential) resource allocation systems (C/D-RAS), in which multiple resource acquisitions and flexible routings are allowed. A new siphon-based characterization o...
متن کاملCorrection to the RUN DAP for conjunctive RAS presented in "Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems"
This note first identifies a problem with the correctness of the RUN DAP for Conjunctive RAS, presented in the above paper,1 and it, subsequently, proceeds to the problem correction through an appropriate policy modification. More specifically, the first part of this note provides a counter example to the policy correctness (i.e., deadlock freedom of the controlled system) claimed in,1 while th...
متن کاملDeadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
This paper considers the deadlock avoidance problem for the class of conjunctive / disjunctive (sequential) resource allocation systems (C/D-RAS), which allows for multiple resource acquisitions and flexible routings. A new siphon-based characterization of deadlocks arising in C/D-RAS is developed, and subsequently, this characterization facilitates the development of a polynomial-complexity de...
متن کاملPolicy mixtures: a novel approach for enhancing the operational flexibility of resource allocation systems with alternate routings
Liveness-enforcing supervisors (LESs) guarantee deadlock-free operations in resource allocation systems (RASs). Given the growing emphasis on higher resource utilization and operational flexibility, it is greatly desirable to obtain the optimal LES that can provide the maximum behavioral latitude. In general, however, computation of the maximally permissive LES is computationally intractable, a...
متن کاملAlgebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems ∗
As many contemporary technological applications move to operational modes of more extensive and flexible automation, there is a rising need to design and control the underlying resource allocation not only for efficiency, but also for logical correctness and internal consistency. The material presented in this chapter offers a unifying and comprehensive treatment of a class of policies that hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001